These activities were developed by Kevin Wortman at Cal State Fullerton.

For full versions, click here.

Stage	Activity Name
2: Piloted	Backtracking Structures
2: Piloted	Binary Heaps
2: Piloted	Binary Tree Traversal
2: Piloted	Crumple Trees
2: Piloted	Divide and Conquer Sorting
2: Piloted	Dynamic Programming
2: Piloted	Graph Structures
2: Piloted	Hashing
2: Piloted	Minimum Spanning Trees
2: Piloted	POGIL Process
2: Piloted	Recursive Algorithms
2: Piloted	Singly-Linked Lists
2: Piloted	Stacks